use std::collections::HashMap;
use std::hash::Hash;
use std::ops::Deref;

/// Counter counts the number of times each value of type T has been seen.
struct Counter<T>
    where T: Eq + PartialEq + Hash
{
    values: HashMap<T, u64>,
}

impl<T> Counter<T>
    where T: Eq + PartialEq + Hash
{
    /// Create a new Counter.
    fn new() -> Self {
        Counter {
            values: HashMap::new(),
        }
    }

    /// Count an occurrence of the given value.
    fn count(&mut self, value: T) {
        self.values
            .entry(value)
            .and_modify(|v| *v += 1)
            .or_insert(1);
    }

    /// Return the number of times the given value has been seen.
    fn times_seen(&self, value: T) -> u64 {
        self.values.get(&value).unwrap_or(&0).to_owned()
        // self.values.get(&value).copied().unwrap_or_default()
    }
}

// #[test]
pub fn test() {
    let mut ctr = Counter::new();
    ctr.count(13);
    ctr.count(14);
    ctr.count(16);
    ctr.count(14);
    ctr.count(14);
    ctr.count(11);

    for i in 10..20 {
        println!("saw {} values equal to {}", ctr.times_seen(i), i);
    }

    let mut strctr = Counter::new();
    strctr.count("apple");
    strctr.count("orange");
    strctr.count("apple");
    println!("got {} apples", strctr.times_seen("apple"));
}